Genetic local search in combinatorial optimization
نویسندگان
چکیده
منابع مشابه
Genetic local search for multi-objective combinatorial optimization
The paper presents a new genetic local search algorithm for multi-objective combinatorial optimization. The goal of the algorithm is to generate in a short time a set of approximately efficient solutions that will allow the decision maker to choose a good compromise solution. In each iteration, the algorithm draws at random a utility function and constructs a temporary population composed of a ...
متن کاملWinner Determination in Combinatorial Auctions using Hybrid Ant Colony Optimization and Multi-Neighborhood Local Search
A combinatorial auction is an auction where the bidders have the choice to bid on bundles of items. The WDP in combinatorial auctions is the problem of finding winning bids that maximize the auctioneer’s revenue under the constraint that each item can be allocated to at most one bidder. The WDP is known as an NP-hard problem with practical applications like electronic commerce, production manag...
متن کامل(Collaborative Reactive Search Optimization): Blending Combinatorial and Continuous Local Search
We propose a heuristic global optimization technique which combines combinatorial and continuous local search. The combinatorial component, based on Reactive Search Optimization, generates a trajectory of binary strings describing search districts. Each district is evaluated by random sampling and by selective runs of continuous local search. A reactive prohibition mechanisms guarantees that th...
متن کاملOn the e ectiveness of genetic search in combinatorial optimization
In this paper, we study the e cacy of genetic algorithms in the context of combinatorial optimization. In particular, we isolate the e ects of cross-over, treated as the central component of genetic search. We show that for problems of nontrivial size and di culty, the contribution of cross-over search is marginal, both synergistically when run in conjunction with mutation and selection, or whe...
متن کاملStochastic Local Search Algorithms for Multiobjective Combinatorial Optimization
The information provided is the sole responsibility of the authors and does not necessarily reflect the opinion of the members of IRIDIA. The authors take full responsability for any copyright breaches that may result from publication of this paper in the IRIDIA – Technical Report Series. IRIDIA is not responsible for any use that might be made of data appearing in this publication.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Applied Mathematics
سال: 1994
ISSN: 0166-218X
DOI: 10.1016/0166-218x(92)00180-t